Existential Dependency: Holes, flaws and problems
نویسندگان
چکیده
منابع مشابه
Reduced dependency spaces for existential parameterised
A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. This system is regarded as a declarative program defining functions that take a datum and returns a Boolean value. The membership problem of PBESs is a problem to decide whether a given element is in the defined set or not, which corresponds ...
متن کاملEfficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Given a quantified boolean formula (QBF) in prenex conjunctive normal form (PCNF), we consider the problem of identifying variable dependencies. In related work, a formal definition of dependencies has been suggested based on quantifier prefix reordering: two variables are independent if swapping them in the prefix does not change satisfiability of the formula. Instead of the general case, we f...
متن کاملReduced Dependency Spaces for Existential Parameterised Boolean Equation Systems
A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regarded as a declarative program defining predicates, where a program execution returns whether a given ground atomic formula holds or not. The program execution corresponds to the membership problem of PBESs, which is ho...
متن کاملReducing Relative Termination to Dependency Pair Problems
Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Proble...
متن کاملRewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
We extend quantified 2-CNF formulas by also allowing literals over free variables which are exempt from the 2-CNF restriction. That means we consider quantified CNF formulas with clauses that contain at most two bound literals and an arbitrary number of free literals. We show that these Q2-CNF formulas can be transformed in polynomial time into purely existentially quantified CNF formulas in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LSA Annual Meeting Extended Abstracts
سال: 2013
ISSN: 2377-3367
DOI: 10.3765/exabs.v0i0.2984